import java.util.ArrayList;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;


public class Test {
	public static void main(String[] args) {
		//int n = sumNumber(7);
		//int[] n = {1,2,3,4};
		//String[] s = {"c","a","r","b","o","n"};
		//String[] s = {"a","b","c"};
		//boolean bo = testUnique(n);
		//int[] test = shuffle(n);
		//System.out.println(factorial(4));
		//System.out.println(Arrays.toString(shuffle(s)));
		//recurse(1);
		
		ArrayList int_no = new ArrayList();
		Scanner scanIn = new Scanner(System.in);
		for (int i =1; i <=3; i++) {
			System.out.println("Enter int"+i+" here : ");
			int_no.add(scanIn.nextLine());
		}
		scanIn.close();
		int int1 = Integer.parseInt((String) int_no.get(0));
		int int2 = Integer.parseInt((String) int_no.get(1));
		int int3 = Integer.parseInt((String) int_no.get(2));
				
		System.out.println(testArithmetic(int1,int2,int3));
	}
	public static String testArithmetic(int int1, int int2, int int3) {
		String string = null;
		if (int1 + int2 == int3) {
			string = int1 + "+" + int2 + "=" + int3;
		} else if (int1 == int2 - int3) {
			string = int1 + "=" + int2 + "-" + int3;
		} else if (int1 * int2 == int3) {
			string = int1 + "+" + int2 + "=" + int3;
		} else {
			string = "no matching";
		}
		return string;
		
	}
	
	
	public boolean  isMultiple(long n, long m) {
		if (n%m == 0) {
			return true;
		} else {
			return false;
		}
		
	}
	
	public static boolean isOdd (int n) {
		if ((n&1) == 0) {
			return false;
		} else {
			return true;
		}
	}
	
	public static int sumNumber (int n) {
		int count =0;
		int sum =0;
		while (count < n) {
			if (isOdd(count)) {
			sum = sum+count;
			}
			count++;
		}	
		return sum;	
	}
	
	public static boolean testPairOdd(int[] n) {
		int count =0;
		boolean firstOdd = false;
		int firstPos = 0;
		boolean secondOdd = false;
		while (count < n.length) {
			int tmp = n[count];
			if (isOdd(tmp)) {
				if (firstOdd == true && (count - firstPos)==1) {
					secondOdd =true;
					return true;
				} else {
					firstOdd = true;
					firstPos = count;
				}	
			}
			count++;
		}
		return false;
	}
	
	public static boolean testUnique(int[] n) {
		int count =0;
		int count1 = 0;
		while (count < n.length) {
			while (count1 < n.length) {
				if (count != count1) {
					int tmp = n[count];
					int tmp1 = n[count1];
					if (tmp == tmp1) {
						return false;
					}
				}
				count1++;
			}
			count1 = 0;
			count++;
		}
		return true;
	}
	
	public static String[] shuffle(String[] S) {
		Random rand = new Random();
		int range = S.length -1;
		for (int i =0; i <= range; i++) {
			int randomNum = rand.nextInt((range - 0) + 1) + 0;
			String tmp = S[randomNum];
			S[randomNum] = S[range];
			S[range] = tmp;
			range = range -1;	
		}
		return S;
	}
	
}


